An interactive heuristic method for multi-objective combinatorial optimization
نویسندگان
چکیده
We have previously developed an adaptation of the simulated annealing for multi-objective combinatorial optimization (MOCO) problems to construct an approximation of the e$cient set of such problem. In order to deal with large-scale problems, we transform this approach to propose an interactive procedure. The method is tested on the multi-objective knapsack problem and the multi-objective assignment problem.
منابع مشابه
Meta-heuristic Algorithms for an Integrated Production-Distribution Planning Problem in a Multi-Objective Supply Chain
In today's globalization, an effective integration of production and distribution plans into a unified framework is crucial for attaining competitive advantage. This paper addresses an integrated multi-product and multi-time period production/distribution planning problem for a two-echelon supply chain subject to the real-world variables and constraints. It is assumed that all transportations a...
متن کاملAn interactive weighted fuzzy goal programming technique to solve multi-objective reliability optimization problem
This paper presents an application of interactive fuzzy goal programming to the nonlinear multi-objective reliability optimization problem considering system reliability and cost of the system as objective functions. As the decision maker always have an intention to produce highly reliable system with minimum cost, therefore, we introduce the interactive method to design a high productivity sys...
متن کاملSelecting Efficient Service-providers in Electric Power Distribution Industry Using Combinatorial Reverse Auction
In this paper, a combinatorial reverse auction mechanism is proposed for selecting the most efficient service-providers for resolving sustained power interruptions in multiple regions of an electric power distribution company’s responsibility area. Through this mechanism, supplying the required service in each region is assigned to only one potential service-provider considering two criteria in...
متن کاملA Novel Particle Swarm Optimization Algorithm for Multi-Objective Combinatorial Optimization Problem
The Combinatorial problems are real world decision making problem with discrete and disjunctive choices. When these decision making problems involve more than one conflicting objective and constraint, it turns the polynomial time problem into NP-hard. Thus, the straight forward approaches to solve multi-objective problems would not give an optimal solution. In such case evolutionary based meta-...
متن کاملAn Interactive Fuzzy Satisfying Method Based on Particle Swarm Optimization for Multi-Objective Function in Reactive Power Market
Reactive power plays an important role in supporting real power transmission, maintaining system voltages within proper limits and overall system reliability. In this paper, the production cost of reactive power, cost of the system transmission loss, investment cost of capacitor banks and absolute value of total voltage deviation (TVD) are included into the objective function of the power flow ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Computers & OR
دوره 27 شماره
صفحات -
تاریخ انتشار 2000